Association Rules Mining with Multiple Constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining association rules with multiple minimum supports using maximum constraints

Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. The support requirements should then vary with different items. In t...

متن کامل

Mining Association Rules with Item Constraints

The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a speci c item or rules that contain children of a speci c item in a hierarchy. While such constraints c...

متن کامل

Mining Class-Association Rules with Constraints

Numerous fast algorithms for mining class-association rules (CARs) have been developed recently. However, in the real world, end-users are often interested in a subset of class-association rules. Particularly, they may consider only rules that contain a specific item or a specific set of items. The nave strategy is to apply such item constraints into the post-processing step. However, such appr...

متن کامل

Mining association rules with multi-dimensional constraints

To improve the effectiveness and efficiency of mining tasks, constraint-based mining enables users to concentrate on mining their interested association rules instead of the complete set of association rules. Previously proposed methods are mainly contributed to handling a single constraint and only consider the constraints which are characterized by a single attribute value. In this paper, we ...

متن کامل

User Constraints in Discovering Association Rules Mining

This paper introduces a new algorithm called User Association Rules Mining (UARM) for solving the problem of generating inadequate large number of rules in mining association technique using a fuzzy logic method [1, 2]. In order to avoid user’s defined threshold mistakes, the user has flexibility to determine constraints based on a set of features. In comparison with other well-known and widely...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Engineering

سال: 2011

ISSN: 1877-7058

DOI: 10.1016/j.proeng.2011.08.313